The spherical genus and virtually planar graphs
نویسندگان
چکیده
منابع مشابه
Morphing Planar Graphs in Spherical Space
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continuous and intersectionfree morph between two sphere drawings of a maximally planar graph, provided that both sphere drawings have convex inscribed polytopes, where sphere drawings are the spherical equivalent of plane d...
متن کاملPlanar Drawings of Higher-Genus Graphs
In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R, with a bounding face defined by a polygonal schema P for S. Our drawings are planar, but they allow for multiple copies of vertices and edges on P’s boundary, which is a common way of visualizing higher-genus...
متن کاملPlanar Crossing Numbers of Genus g Graphs
Pach and Tóth [15] proved that any n-vertex graph of genus g and maximum degree d has a planar crossing number at most cdn, for a constant c > 1. We improve on this results by decreasing the bound to O(dgn), if g = o(n), and to O(g), otherwise, and also prove that our result is tight within a constant factor.
متن کاملPlanar Crossing Numbers of Graphs of Bounded Genus
Pach and Tóth proved that any n-vertex graph of genus g and maximum degree d has a planar crossing number at most cdn, for a constant c > 1. We improve on this results by decreasing the bound to O(dgn), and also prove that our result is tight within a constant factor. Our proof is constructive and yields an algorithm with time complexity O(dgn). As a consequence of our main result, we show a re...
متن کاملSpectral radius of finite and infinite planar graphs and of graphs of bounded genus
It is well known that the spectral radius of a tree whose maximum degree is D cannot exceed 2 √ D − 1. In this paper we derive similar bounds for arbitrary planar graphs and for graphs of bounded genus. It is proved that a the spectral radius ρ(G) of a planar graph G of maximum vertex degree D ≥ 4 satisfies √D ≤ ρ(G) ≤ √8D − 16 + 7.75. This result is best possible up to the additive constant—we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1988
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90090-8